Subwords in reverse - complement order - Extended abstract ∗ Péter
نویسندگان
چکیده
We examine finite words over an alphabet Γ = {a, ā; b, b̄} of pairs of letters, where each word w1w2...wt is identified with its reverse complement w̄t...w̄2w̄1 (where ā = a, b̄ = b). We seek the smallest k such that every word of length n, composed from Γ, is uniquely ∗This work was supported, in part, by Hungarian NSF, under contract Nos. AT48826, NK62321, F043772, N34040, T34702, T37846, T43758, ETIK, Magyary Z. grant and by the U.S.D.O.E.
منابع مشابه
Reconstruction from subwords ∗
In the paper two variants of a combinatorial problem for the set F n q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was the following: for a given word w ∈ F n q , what is the smallest integer k such that we can reconstruct w if we know all of its subwords of length k. This problem was solved by Lothaire [8] . We ...
متن کاملDNA-words and word posets
In the paper two variants of a combinatorial problem for the set F q of sequences of length n over the alphabet Fq = {0, 1, .., q − 1} are considered, with some applications. The original problem was the following: what is the smallest k such that every word v ∈ F q is uniquely determined by the set of its subwords of length up to k. This problem was solved by Lothaire [1]. We consider the foll...
متن کاملA linear algorithm for string reconstruction in the reverse complement equivalence model
In the reverse complement equivalence model, it is not possible to distinguish a string from its reverse complement. We show that one can still reconstruct a string of length n, up to reverse complement, using a linear number of subsequence queries of bounded length. We first give the proof for strings over a binary alphabet, and then extend it to arbitrary finite alphabets. A simple informatio...
متن کاملOn Quasi Orders of Words and the Confluence Property
We investigate the con uence property, that is, the property of a language to contain, for any two words of it, one which is bigger, with respect to a given quasi order on the respective free monoid, than each of the former two. This property is investigated mainly for regular and context-free languages. As a consequence of our study, we give an answer to an old open problem raised by Haines co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006